evaluation accuracy of nearest neighbor sampling method in zagross forests

نویسندگان

yousef askari

ph.d student of forestry, faculty of natural resources and earth science, university of shahrekord, shahrekord, iran pejman tahmasebi kohyani

assistant professor of rangeland, faculty of natural resources and earth science, university of shahrekord, shahrekord, iran

چکیده

collection of appropriate qualitative and quantitative data is necessary for proper management and planning. used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. nearest neighbor sampling method is a one of distance methods and calculated by three equations (byth and riple, 1980; cotam and curtis, 1956 and cotam and curtis, 1956). the 53 hectare of the study area was selected and perfect inventory. to study of nearest neighbor sampling method used the systematic-random methods in the 100*150 meter net and recorded the location (x, y) of all trees and by nearest neighbor sampling method in the 30 to 40 samples evaluated the accuracy of this method. results showed that the three formulas in this study not have accuracy for study of density (n/ha), but suitable to study of spatial pattern. the quantity of johnson & zimmer index is a 5.522 and showed that a clumped pattern for trees in forest reserve. overall results showed that the nearest neighbor sampling method and byth and riple (1980) equation are a suitable method to study of tree spatial pattern in zagros forest

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests

Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...

متن کامل

Evaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests

Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...

متن کامل

kth Nearest Neighbor Sampling in the Plane

Let B be a square region in the plane. We give an efficient algorithm that takes a set P of n points from B, and produces a set M ⊂ B with the property that the distance to the second nearest point in M approximates the distance to the kth nearest point of P . That is, there are constants α, β ∈ R such that for all x ∈ B, we have αdP,k(x) ≤ dM,2(x) ≤ βdP,k(x), where dM,2 and dP,k denote the sec...

متن کامل

{36 () Selective Sampling for Nearest Neighbor Classiiers *

Most existing inductive learning algorithms assume the availability of a training set of labeled examples. In many domains, however, labeling the examples is a costly process that requires either intensive computation or manual labor. In such cases, it may be beneecial for the learner to be active by intelligent selection of examples for labeling with the goal of reducing the labeling cost. In ...

متن کامل

Selective Sampling for Nearest Neighbor Classi ers

In the passive, traditional, approach to learning, the information available to the learner is a set of classiied examples, which are randomly drawn from the instance space. In many applications, however, the initial clas-siication of the training set is a costly process, and an intelligently selection of training examples from unla-beled data is done by an active learner. This paper proposes a...

متن کامل

Non-zero probability of nearest neighbor searching

Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of advanced biological and biomedical research

جلد ۱، شماره ۹، صفحات ۹۹۹-۱۰۰۸

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023